Maximal antichains under dimension constraints
نویسندگان
چکیده
We consider A(n, k) = maxA{|A| : dim(A) ≤ k, A ⊂ {0, 1} n is an antichain}, where the dimension is taken from the linear span of A in R, we conjecture the exact value of A(n, k) and we prove this conjecture for all n and k ≤ ⌊ n 2 ⌋ +1 or k = n−1. This is a contribution to the program of systematic investigation of extremal problems under dimension constraints, which was recently presented by the authors.
منابع مشابه
Thin Maximal Antichains in the Turing Degrees
We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 maximal antichains in the Turing degrees in terms of (relatively) constructible reals. A corollary of our main result gives a negative solution to a question of Jockusch under the assumption that every real is constructible.
متن کاملPerfect sets and collapsing continuum
Under Martin’s axiom, collapsing of the continuum by Sacks forcing S is characterized by the additivity of Marczewski’s ideal (see [4]). We show that the same characterization holds true if d = c proving that under this hypothesis there are no small uncountable maximal antichains in S. We also construct a partition of 2 into c perfect sets which is a maximal antichain in S and show that s-sets ...
متن کاملOn Finite Maximal Antichains in the Homomorphism Order
The relation of existence of a homomorphism on the class of all relational structures of a fixed type is reflexive and transitive; it is a quasiorder. There are standard ways to transform a quasiorder into a partial order – by identifying equivalent objects, or by choosing a particular representative for each equivalence class. The resulting partial order is identical in both cases. Properties ...
متن کاملMaximal Antichain Lattice Algorithms for Distributed Computations
The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct an...
متن کاملSplitting finite antichains in the homomorphism order
A structural condition is given for finite maximal antichains in the homomorphism order of relational structures to have the splitting property. It turns out that non-splitting antichains appear only at the bottom of the order. Moreover, we examine looseness and finite antichain extension property for some subclasses of the homomorphism poset. Finally, we take a look at cut-points in this order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2003